Dynamic Parallel Job Scheduling in Multi-cluster Computing Systems

نویسنده

  • Jemal H. Abawajy
چکیده

Job scheduling is a complex problem, yet it is fundamental to sustaining and improving the performance of parallel processing systems. In this paper, we address an on-line parallel job scheduling problem in heterogeneous multi-cluster computing systems. We propose a new spacesharing scheduling policy and show that it performs substantially better than the conventional policies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Green Energy-aware task scheduling using the DVFS technique in Cloud Computing

Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...

متن کامل

Coscheduling on Cluster Systems

Coordinated scheduling of parallel jobs across the nodes of a multiprocessor system is known to produce benefits in both system and individual job efficiency. Without coordinated scheduling, the processes constituting a parallel job would suffer high communication latencies because of processor thrashing. With clusters connected by highperformance networks that achieve latencies in the range of...

متن کامل

Multi - Processor Mapping

The problem of scheduling a set of tasks to a set of processors can be divided into two categories: job scheduling and scheduling and mapping. In the former category, independent jobs are to be scheduled among the processors of a distributed computing system to optimize overall system performance [1][2]. In contrast, the scheduling and mapping problem requires the allocation of multiple interac...

متن کامل

حل مسأله زمان‌بندی کار کارگاهی چندهدفی انعطاف‌پذیرِ پویا به وسیله الگوریتم ژنتیک توسعه‌یافته

In this paper, Multi-Objective Flexible Job-Shop scheduling with Parallel Machines in Dynamic manufacturing environment (MO-FDJSPM) is investigated. Moreover considering dynamical job-shop environment (jobs arrived in non-zero time), It contains two kinds of flexibility which is effective for improving operational manufacturing systems. The non-flexibility leads to scheduling program which have...

متن کامل

An Integrated Resource Schedu ing Approach on C Computing Systems

This paper addresses the problem of a unified framework for resource scheduling with emerging constraints that are important in cluster computing systems. Most research in job scheduling study in multi-programmed systems has focused solely on the allocation of processors to jobs. However, since I/O is also a critical resource for many parallel jobs, the allocation of processor and I/O resources...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004